Finite Limits and Lower Bounds for Circuits Size
نویسنده
چکیده
The lower bounds problem in circuit complexity theory may be looked as the problem about the possibility to diagonalize over nite sets of computations. In this paper we show that Sipser's notion of ""nite limit" is the right diagonal for diierent models of small-depth circuits. This is partly a survey paper, but it also contains various new results as well as new proofs of know ones.
منابع مشابه
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains
In this paper we show some lower bounds for the size of multiplicative circuits computing multi-output functions in some noncommutative domains like monoids and finite groups. We also introduce and study a generalization of linear circuits in which the goal is to compute MY where Y is a vector of indeterminates and M is a matrix whose entries come from noncommutative rings. We show some lower b...
متن کاملStrong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملAn Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields
In this paper, we show exponential lower bounds for the class of homogeneous depth-5 circuits over all small finite fields. More formally, we show that there is an explicit family {Pd : d ∈ N} of polynomials in VNP, where Pd is of degree d in n = dO(1) variables, such that over all finite fields Fq, any homogeneous depth-5 circuit which computes Pd must have size at least exp(Ωq( √ d)). To the ...
متن کاملFinite Limits and Monotone Computations: The Lower Bounds Criterion
Our main result is a combinatorial lower bounds criterion for monotone circuits over the reals. We allow any unbounded fanin non-decreasing real-valued functions as gates. The only requirement is their "local-ity". Unbounded fanin AND and OR gates, as well as any threshold gate T m s (x 1 ; : : : ; x m) with small enough threshold value minfs; m ? s + 1g, are simplest examples of local gates. T...
متن کاملAverage-case complexity of detecting cliques
The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental problems studied in theoretical computer science. This thesis is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain models of computation, solving k-CLIQUE in the average case requires Q(nk/4) resources (moreover, k/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Universität Trier, Mathematik/Informatik, Forschungsbericht
دوره 94-06 شماره
صفحات -
تاریخ انتشار 1994